0.03/0.07 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.07 % Command : run_E %s %d THM 0.07/0.26 % Computer : n005.cluster.edu 0.07/0.26 % Model : x86_64 x86_64 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.07/0.26 % Memory : 8042.1875MB 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64 0.07/0.26 % CPULimit : 960 0.07/0.26 % WCLimit : 120 0.07/0.26 % DateTime : Tue Aug 9 05:42:19 EDT 2022 0.07/0.26 % CPUTime : 0.10/0.38 Running higher-order on 8 cores theorem proving 0.10/0.38 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.10/0.38 # Version: 3.0pre003-ho 0.10/0.51 # Preprocessing class: HSLSSMSMSSMCHFA. 0.10/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.10/0.51 # Starting full_lambda_5 with 600s (5) cores 0.10/0.51 # Starting new_ho_12 with 120s (1) cores 0.10/0.51 # Starting pre_casc_5 with 120s (1) cores 0.10/0.51 # Starting full_lambda_9 with 120s (1) cores 0.10/0.51 # new_ho_12 with pid 10992 completed with status 0 0.10/0.51 # Result found by new_ho_12 0.10/0.51 # Preprocessing class: HSLSSMSMSSMCHFA. 0.10/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.10/0.51 # Starting full_lambda_5 with 600s (5) cores 0.10/0.51 # Starting new_ho_12 with 120s (1) cores 0.10/0.51 # No SInE strategy applied 0.10/0.51 # Search class: HGHSM-FSLM32-MHFFFSBN 0.10/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.10/0.51 # Starting sh9 with 65s (1) cores 0.10/0.51 # sh9 with pid 11002 completed with status 0 0.10/0.51 # Result found by sh9 0.10/0.51 # Preprocessing class: HSLSSMSMSSMCHFA. 0.10/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.10/0.51 # Starting full_lambda_5 with 600s (5) cores 0.10/0.51 # Starting new_ho_12 with 120s (1) cores 0.10/0.51 # No SInE strategy applied 0.10/0.51 # Search class: HGHSM-FSLM32-MHFFFSBN 0.10/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.10/0.51 # Starting sh9 with 65s (1) cores 0.10/0.51 # Preprocessing time : 0.007 s 0.10/0.51 # Presaturation interreduction done 0.10/0.51 0.10/0.51 # Proof found! 0.10/0.51 # SZS status Theorem 0.10/0.51 # SZS output start CNFRefutation 0.10/0.51 thf(decl_22, type, plus_plus_multiset_a: multiset_a > multiset_a > multiset_a). 0.10/0.51 thf(decl_23, type, zero_zero_multiset_a: multiset_a). 0.10/0.51 thf(decl_24, type, nO_MAT1617603563iset_a: multiset_a > multiset_a > $o). 0.10/0.51 thf(decl_25, type, heapIm1140443833left_a: tree_a > tree_a). 0.10/0.51 thf(decl_26, type, heapIm1257206334ight_a: tree_a > tree_a). 0.10/0.51 thf(decl_27, type, heapIm1091024090Down_a: tree_a > tree_a). 0.10/0.51 thf(decl_28, type, e_a: tree_a). 0.10/0.51 thf(decl_29, type, t_a: a > tree_a > tree_a > tree_a). 0.10/0.51 thf(decl_30, type, rel_Tree_a_a: (a > a > $o) > tree_a > tree_a > $o). 0.10/0.51 thf(decl_31, type, in_tree_a: a > tree_a > $o). 0.10/0.51 thf(decl_32, type, is_heap_a: tree_a > $o). 0.10/0.51 thf(decl_33, type, multiset_a2: tree_a > multiset_a). 0.10/0.51 thf(decl_34, type, val_a: tree_a > a). 0.10/0.51 thf(decl_35, type, lattic146396397_Max_a: set_a > a). 0.10/0.51 thf(decl_36, type, add_mset_a: a > multiset_a > multiset_a). 0.10/0.51 thf(decl_37, type, comm_m315775925iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.10/0.51 thf(decl_38, type, fold_m382157835iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.10/0.51 thf(decl_39, type, fold_m364285649iset_a: (a > multiset_a > multiset_a) > multiset_a > multiset_a > multiset_a). 0.10/0.51 thf(decl_40, type, image_929116801iset_a: (a > multiset_a) > multiset_a > multiset_multiset_a). 0.10/0.51 thf(decl_41, type, image_mset_a_a: (a > a) > multiset_a > multiset_a). 0.10/0.51 thf(decl_42, type, mult1_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.10/0.51 thf(decl_43, type, mult_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.10/0.51 thf(decl_44, type, set_mset_multiset_a: multiset_multiset_a > set_multiset_a). 0.10/0.51 thf(decl_45, type, set_mset_a: multiset_a > set_a). 0.10/0.51 thf(decl_46, type, subseteq_mset_a: multiset_a > multiset_a > $o). 0.10/0.51 thf(decl_47, type, ord_less_eq_o_o_a: ($o > $o > a) > ($o > $o > a) > $o). 0.10/0.51 thf(decl_48, type, ord_less_eq_o_a: ($o > a) > ($o > a) > $o). 0.10/0.51 thf(decl_49, type, ord_le1530450702ee_a_o: (tree_a > tree_a > $o) > (tree_a > tree_a > $o) > $o). 0.10/0.51 thf(decl_50, type, ord_less_eq_a_a_o: (a > a > $o) > (a > a > $o) > $o). 0.10/0.51 thf(decl_51, type, ord_le1199012836iset_a: multiset_a > multiset_a > $o). 0.10/0.51 thf(decl_52, type, ord_less_eq_set_a: set_a > set_a > $o). 0.10/0.51 thf(decl_53, type, ord_less_eq_a: a > a > $o). 0.10/0.51 thf(decl_54, type, order_Greatest_o_a: (($o > a) > $o) > $o > a). 0.10/0.51 thf(decl_55, type, order_Greatest_a: (a > $o) > a). 0.10/0.51 thf(decl_56, type, produc2037245207iset_a: multiset_a > multiset_a > produc1127127335iset_a). 0.10/0.51 thf(decl_57, type, product_Pair_a_a: a > a > product_prod_a_a). 0.10/0.51 thf(decl_58, type, irrefl_a: set_Product_prod_a_a > $o). 0.10/0.51 thf(decl_59, type, trans_a: set_Product_prod_a_a > $o). 0.10/0.51 thf(decl_60, type, collect_a: (a > $o) > set_a). 0.10/0.51 thf(decl_61, type, member_multiset_a: multiset_a > set_multiset_a > $o). 0.10/0.51 thf(decl_62, type, member340150864iset_a: produc1127127335iset_a > set_Pr158363655iset_a > $o). 0.10/0.51 thf(decl_63, type, member449909584od_a_a: product_prod_a_a > set_Product_prod_a_a > $o). 0.10/0.51 thf(decl_64, type, member_a: a > set_a > $o). 0.10/0.51 thf(decl_65, type, l: tree_a). 0.10/0.51 thf(decl_66, type, l1: tree_a). 0.10/0.51 thf(decl_67, type, la: tree_a). 0.10/0.51 thf(decl_68, type, r: tree_a). 0.10/0.51 thf(decl_69, type, r1: tree_a). 0.10/0.51 thf(decl_70, type, ra: tree_a). 0.10/0.51 thf(decl_71, type, t: tree_a). 0.10/0.51 thf(decl_72, type, v: a). 0.10/0.51 thf(decl_73, type, v1: a). 0.10/0.51 thf(decl_74, type, v2: a). 0.10/0.51 thf(decl_75, type, va: a). 0.10/0.51 thf(decl_76, type, esk1_1: tree_a > a). 0.10/0.51 thf(decl_77, type, esk2_1: tree_a > a). 0.10/0.51 thf(decl_78, type, esk3_1: tree_a > a). 0.10/0.51 thf(decl_79, type, esk4_1: tree_a > tree_a). 0.10/0.51 thf(decl_80, type, esk5_1: tree_a > tree_a). 0.10/0.51 thf(decl_81, type, esk6_1: tree_a > a). 0.10/0.51 thf(decl_82, type, esk7_1: tree_a > a). 0.10/0.51 thf(decl_83, type, esk8_1: tree_a > tree_a). 0.10/0.51 thf(decl_84, type, esk9_1: tree_a > tree_a). 0.10/0.51 thf(decl_85, type, esk10_1: tree_a > a). 0.10/0.51 thf(decl_86, type, esk11_1: tree_a > a). 0.10/0.51 thf(decl_87, type, esk12_1: tree_a > tree_a). 0.10/0.51 thf(decl_88, type, esk13_1: tree_a > tree_a). 0.10/0.51 thf(decl_89, type, esk14_1: tree_a > a). 0.10/0.51 thf(decl_90, type, esk15_1: tree_a > tree_a). 0.10/0.51 thf(decl_91, type, esk16_1: tree_a > tree_a). 0.10/0.51 thf(decl_92, type, esk17_1: multiset_a > multiset_a). 0.10/0.51 thf(decl_93, type, esk18_1: multiset_a > a). 0.10/0.51 thf(decl_94, type, esk19_2: tree_a > a > tree_a). 0.10/0.51 thf(decl_95, type, esk20_2: tree_a > a > a). 0.10/0.51 thf(decl_96, type, esk21_2: tree_a > a > tree_a). 0.10/0.51 thf(decl_97, type, esk22_2: (($o > a) > $o) > ($o > a) > $o > a). 0.10/0.51 thf(decl_98, type, esk23_3: (($o > a) > $o) > ($o > a) > (($o > a) > $o) > $o > a). 0.10/0.51 thf(decl_99, type, esk24_2: a > multiset_a > multiset_a). 0.10/0.51 thf(decl_100, type, esk25_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_101, type, esk26_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_102, type, esk27_4: a > (a > a) > a > a > a). 0.10/0.51 thf(decl_103, type, esk28_4: a > (a > a) > a > a > a). 0.10/0.51 thf(decl_104, type, esk29_2: (($o > a) > $o) > ($o > a) > $o > a). 0.10/0.51 thf(decl_105, type, esk30_2: set_a > set_a > a). 0.10/0.51 thf(decl_106, type, esk31_1: tree_a > a). 0.10/0.51 thf(decl_107, type, esk32_1: tree_a > tree_a). 0.10/0.51 thf(decl_108, type, esk33_1: tree_a > tree_a). 0.10/0.51 thf(decl_109, type, epred1_2: ($o > a) > ($o > a) > $o). 0.10/0.51 thf(decl_110, type, esk34_3: a > multiset_a > multiset_multiset_a > multiset_a). 0.10/0.51 thf(decl_111, type, epred2_2: ($o > a) > ($o > a) > $o). 0.10/0.51 thf(decl_112, type, esk35_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.10/0.51 thf(decl_113, type, esk36_4: a > multiset_a > a > multiset_a > multiset_a). 0.10/0.51 thf(decl_114, type, esk37_4: a > a > (a > $o > a) > ($o > a) > a). 0.10/0.51 thf(decl_115, type, esk38_4: a > a > (a > $o > a) > ($o > a) > a). 0.10/0.51 thf(decl_116, type, esk39_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.10/0.51 thf(decl_117, type, esk40_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.10/0.51 thf(decl_118, type, esk41_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.10/0.51 thf(decl_119, type, esk42_4: set_Product_prod_a_a > multiset_a > multiset_a > a > a). 0.10/0.51 thf(decl_120, type, esk43_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_121, type, esk44_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_122, type, esk45_1: multiset_a > a). 0.10/0.51 thf(decl_123, type, esk46_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_124, type, esk47_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_125, type, esk48_2: set_a > set_a > a). 0.10/0.51 thf(decl_126, type, esk49_1: (a > a > $o) > a). 0.10/0.51 thf(decl_127, type, esk50_1: (a > a > $o) > a). 0.10/0.51 thf(decl_128, type, esk51_1: (a > a > $o) > a). 0.10/0.51 thf(decl_129, type, esk52_1: (a > a > $o) > a). 0.10/0.51 thf(decl_130, type, esk53_1: multiset_multiset_a > multiset_a). 0.10/0.51 thf(decl_131, type, esk54_2: a > multiset_a > multiset_a). 0.10/0.51 thf(decl_132, type, esk55_2: (a > $o) > a > a). 0.10/0.51 thf(decl_133, type, esk56_1: (multiset_a > $o) > a). 0.10/0.51 thf(decl_134, type, esk57_1: (multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_135, type, esk58_6: multiset_a > a > multiset_a > multiset_a > multiset_a > set_Product_prod_a_a > a). 0.10/0.51 thf(decl_136, type, esk59_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_137, type, esk60_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_138, type, esk61_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.10/0.51 thf(decl_139, type, esk62_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.10/0.51 thf(decl_140, type, esk63_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_141, type, esk64_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_142, type, esk65_1: (multiset_a > $o) > a). 0.10/0.51 thf(decl_143, type, esk66_1: (multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_144, type, esk67_4: ($o > a) > (a > $o > a) > a > a > a). 0.10/0.51 thf(decl_145, type, esk68_4: ($o > a) > (a > $o > a) > a > a > a). 0.10/0.51 thf(decl_146, type, esk69_1: tree_a > a). 0.10/0.51 thf(decl_147, type, esk70_1: tree_a > a). 0.10/0.51 thf(decl_148, type, esk71_1: tree_a > a). 0.10/0.51 thf(decl_149, type, esk72_1: tree_a > tree_a). 0.10/0.51 thf(decl_150, type, esk73_1: tree_a > tree_a). 0.10/0.51 thf(decl_151, type, esk74_1: tree_a > a). 0.10/0.51 thf(decl_152, type, esk75_1: tree_a > a). 0.10/0.51 thf(decl_153, type, esk76_1: tree_a > tree_a). 0.10/0.51 thf(decl_154, type, esk77_1: tree_a > tree_a). 0.10/0.51 thf(decl_155, type, esk78_1: tree_a > a). 0.10/0.51 thf(decl_156, type, esk79_1: tree_a > a). 0.10/0.51 thf(decl_157, type, esk80_1: tree_a > tree_a). 0.10/0.51 thf(decl_158, type, esk81_1: tree_a > tree_a). 0.10/0.51 thf(decl_159, type, esk82_1: tree_a > a). 0.10/0.51 thf(decl_160, type, esk83_1: tree_a > tree_a). 0.10/0.51 thf(decl_161, type, esk84_1: tree_a > tree_a). 0.10/0.51 thf(decl_162, type, esk85_3: multiset_a > multiset_a > (multiset_a > $o) > a). 0.10/0.51 thf(decl_163, type, esk86_3: multiset_a > multiset_a > (multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_164, type, esk87_2: (a > $o) > a > a). 0.10/0.51 thf(decl_165, type, esk88_3: (a > $o) > a > (a > $o) > a). 0.10/0.51 thf(decl_166, type, esk89_1: (multiset_a > $o) > a). 0.10/0.51 thf(decl_167, type, esk90_1: (multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_168, type, esk91_4: ($o > a) > (a > $o > a) > a > a > a). 0.10/0.51 thf(decl_169, type, esk92_4: ($o > a) > (a > $o > a) > a > a > a). 0.10/0.51 thf(decl_170, type, esk93_1: (tree_a > $o) > a). 0.10/0.51 thf(decl_171, type, esk94_1: (tree_a > $o) > tree_a). 0.10/0.51 thf(decl_172, type, esk95_1: (tree_a > $o) > tree_a). 0.10/0.51 thf(decl_173, type, esk96_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.10/0.51 thf(decl_174, type, esk97_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.10/0.51 thf(decl_175, type, esk98_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.10/0.51 thf(decl_176, type, esk99_3: (a > a > $o) > tree_a > tree_a > a). 0.10/0.51 thf(decl_177, type, esk100_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.10/0.51 thf(decl_178, type, esk101_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.10/0.51 thf(decl_179, type, esk102_3: (a > a > $o) > tree_a > tree_a > a). 0.10/0.51 thf(decl_180, type, esk103_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.10/0.51 thf(decl_181, type, esk104_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.10/0.51 thf(decl_182, type, esk105_4: (a > a) > a > multiset_a > multiset_a > multiset_a). 0.10/0.51 thf(decl_183, type, esk106_1: (a > a > $o) > a). 0.10/0.51 thf(decl_184, type, esk107_2: set_a > set_a > a). 0.10/0.51 thf(decl_185, type, esk108_1: multiset_a > a). 0.10/0.51 thf(decl_186, type, esk109_1: multiset_a > multiset_a). 0.10/0.51 thf(decl_187, type, esk110_4: a > a > (a > a) > a > a). 0.10/0.51 thf(decl_188, type, esk111_4: a > a > (a > a) > a > a). 0.10/0.51 thf(decl_189, type, esk112_3: multiset_a > (a > multiset_a) > (a > multiset_a) > a). 0.10/0.51 thf(decl_190, type, esk113_1: (multiset_a > multiset_a > $o) > a). 0.10/0.51 thf(decl_191, type, esk114_1: (multiset_a > multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_192, type, esk115_1: (multiset_a > multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_193, type, esk116_1: (multiset_a > multiset_a > $o) > a). 0.10/0.51 thf(decl_194, type, esk117_1: (multiset_a > multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_195, type, esk118_1: (multiset_a > multiset_a > $o) > multiset_a). 0.10/0.51 thf(decl_196, type, esk119_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.10/0.51 thf(decl_197, type, esk120_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.10/0.51 thf(decl_198, type, esk121_4: a > (a > a) > a > a > a). 0.10/0.51 thf(decl_199, type, esk122_4: a > (a > a) > a > a > a). 0.10/0.51 thf(decl_200, type, esk123_4: a > a > (a > a) > a > a). 0.10/0.51 thf(decl_201, type, esk124_4: a > a > (a > a) > a > a). 0.10/0.51 thf(decl_202, type, esk125_4: a > a > (a > $o > a) > ($o > a) > a). 0.10/0.51 thf(decl_203, type, esk126_4: a > a > (a > $o > a) > ($o > a) > a). 0.10/0.51 thf(decl_204, type, esk127_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_205, type, esk128_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.10/0.51 thf(decl_206, type, esk129_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > a). 0.10/0.51 thf(decl_207, type, esk130_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.10/0.51 thf(decl_208, type, esk131_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.10/0.51 thf(decl_209, type, esk132_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > a). 0.10/0.51 thf(decl_210, type, esk133_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.10/0.51 thf(decl_211, type, esk134_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.10/0.51 thf(decl_212, type, esk135_4: (a > a) > multiset_a > a > multiset_a > multiset_a). 0.10/0.51 thf(decl_213, type, esk136_4: (a > a) > multiset_a > a > multiset_a > a). 0.10/0.51 thf(decl_214, type, esk137_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.10/0.51 thf(decl_215, type, esk138_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.10/0.51 thf(decl_216, type, epred3_1: set_a > a > $o). 0.10/0.51 thf(fact_20_left_Osimps, axiom, ![X22:a, X26:tree_a, X27:tree_a]:(((heapIm1140443833left_a @ (t_a @ X22 @ X26 @ X27))=(X26))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_20_left_Osimps)). 0.10/0.51 thf(fact_5__C4_Oprems_C_I3_J, axiom, ((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ va @ la @ ra)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5__C4_Oprems_C_I3_J)). 0.10/0.51 thf(fact_22_val_Osimps, axiom, ![X22:a, X123:tree_a, X124:tree_a]:(((val_a @ (t_a @ X22 @ X123 @ X124))=(X22))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_22_val_Osimps)). 0.10/0.51 thf(fact_30_siftDown_Osimps_I4_J, axiom, ![X47:a, X48:tree_a, X49:tree_a, X22:a]:(((~((ord_less_eq_a @ (val_a @ (t_a @ X47 @ X48 @ X49)) @ X22))=>((heapIm1091024090Down_a @ (t_a @ X22 @ e_a @ (t_a @ X47 @ X48 @ X49)))=(t_a @ (val_a @ (t_a @ X47 @ X48 @ X49)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X22 @ (heapIm1140443833left_a @ (t_a @ X47 @ X48 @ X49)) @ (heapIm1257206334ight_a @ (t_a @ X47 @ X48 @ X49)))))))&((ord_less_eq_a @ (val_a @ (t_a @ X47 @ X48 @ X49)) @ X22)=>((heapIm1091024090Down_a @ (t_a @ X22 @ e_a @ (t_a @ X47 @ X48 @ X49)))=(t_a @ X22 @ e_a @ (t_a @ X47 @ X48 @ X49)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_30_siftDown_Osimps_I4_J)). 0.10/0.51 thf(fact_34_right_Osimps, axiom, ![X22:a, X26:tree_a, X27:tree_a]:(((heapIm1257206334ight_a @ (t_a @ X22 @ X26 @ X27))=(X27))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_34_right_Osimps)). 0.10/0.51 thf(fact_32_is__heap_Osimps_I3_J, axiom, ![X22:a, X47:a, X48:tree_a, X49:tree_a]:(((is_heap_a @ (t_a @ X22 @ e_a @ (t_a @ X47 @ X48 @ X49)))<=>((is_heap_a @ (t_a @ X47 @ X48 @ X49))&(ord_less_eq_a @ (val_a @ (t_a @ X47 @ X48 @ X49)) @ X22)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_32_is__heap_Osimps_I3_J)). 0.10/0.51 thf(conj_0, conjecture, (is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.10/0.51 thf(fact_4_True, axiom, (ord_less_eq_a @ v1 @ v2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4_True)). 0.10/0.51 thf(fact_0__C4_Oprems_C_I2_J, axiom, (is_heap_a @ ra), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0__C4_Oprems_C_I2_J)). 0.10/0.51 thf(c_0_9, plain, ![X1016:a, X1017:tree_a, X1018:tree_a]:(((heapIm1140443833left_a @ (t_a @ X1016 @ X1017 @ X1018))=(X1017))), inference(variable_rename,[status(thm)],[fact_20_left_Osimps])). 0.10/0.51 thf(c_0_10, plain, ![X3:a, X13:tree_a, X10:tree_a]:(((heapIm1140443833left_a @ (t_a @ X3 @ X10 @ X13))=(X10))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.10/0.51 thf(c_0_11, plain, ((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ va @ la @ ra)), inference(split_conjunct,[status(thm)],[fact_5__C4_Oprems_C_I3_J])). 0.10/0.51 thf(c_0_12, plain, ![X1130:a, X1131:tree_a, X1132:tree_a]:(((val_a @ (t_a @ X1130 @ X1131 @ X1132))=(X1130))), inference(variable_rename,[status(thm)],[fact_22_val_Osimps])). 0.10/0.51 thf(c_0_13, plain, ((la)=(e_a)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_10])). 0.10/0.51 thf(c_0_14, plain, ![X47:a, X48:tree_a, X49:tree_a, X22:a]:(((~(ord_less_eq_a @ (val_a @ (t_a @ X47 @ X48 @ X49)) @ X22)=>((heapIm1091024090Down_a @ (t_a @ X22 @ e_a @ (t_a @ X47 @ X48 @ X49)))=(t_a @ (val_a @ (t_a @ X47 @ X48 @ X49)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X22 @ (heapIm1140443833left_a @ (t_a @ X47 @ X48 @ X49)) @ (heapIm1257206334ight_a @ (t_a @ X47 @ X48 @ X49)))))))&((ord_less_eq_a @ (val_a @ (t_a @ X47 @ X48 @ X49)) @ X22)=>((heapIm1091024090Down_a @ (t_a @ X22 @ e_a @ (t_a @ X47 @ X48 @ X49)))=(t_a @ X22 @ e_a @ (t_a @ X47 @ X48 @ X49)))))), inference(fof_simplification,[status(thm)],[fact_30_siftDown_Osimps_I4_J])). 0.10/0.51 thf(c_0_15, plain, ![X13:tree_a, X10:tree_a, X3:a]:(((val_a @ (t_a @ X3 @ X10 @ X13))=(X3))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.10/0.51 thf(c_0_16, plain, ((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ va @ e_a @ ra)), inference(rw,[status(thm)],[c_0_11, c_0_13])). 0.10/0.51 thf(c_0_17, plain, ![X974:a, X975:tree_a, X976:tree_a, X977:a]:((((ord_less_eq_a @ (val_a @ (t_a @ X974 @ X975 @ X976)) @ X977)|((heapIm1091024090Down_a @ (t_a @ X977 @ e_a @ (t_a @ X974 @ X975 @ X976)))=(t_a @ (val_a @ (t_a @ X974 @ X975 @ X976)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X977 @ (heapIm1140443833left_a @ (t_a @ X974 @ X975 @ X976)) @ (heapIm1257206334ight_a @ (t_a @ X974 @ X975 @ X976)))))))&(~(ord_less_eq_a @ (val_a @ (t_a @ X974 @ X975 @ X976)) @ X977)|((heapIm1091024090Down_a @ (t_a @ X977 @ e_a @ (t_a @ X974 @ X975 @ X976)))=(t_a @ X977 @ e_a @ (t_a @ X974 @ X975 @ X976)))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])). 0.10/0.51 thf(c_0_18, plain, ![X1238:a, X1239:tree_a, X1240:tree_a]:(((heapIm1257206334ight_a @ (t_a @ X1238 @ X1239 @ X1240))=(X1240))), inference(variable_rename,[status(thm)],[fact_34_right_Osimps])). 0.10/0.51 thf(c_0_19, plain, ((va)=(v2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_15])). 0.10/0.51 thf(c_0_20, plain, ![X1443:a, X1444:a, X1445:tree_a, X1446:tree_a]:(((((is_heap_a @ (t_a @ X1444 @ X1445 @ X1446))|~(is_heap_a @ (t_a @ X1443 @ e_a @ (t_a @ X1444 @ X1445 @ X1446))))&((ord_less_eq_a @ (val_a @ (t_a @ X1444 @ X1445 @ X1446)) @ X1443)|~(is_heap_a @ (t_a @ X1443 @ e_a @ (t_a @ X1444 @ X1445 @ X1446)))))&(~(is_heap_a @ (t_a @ X1444 @ X1445 @ X1446))|~(ord_less_eq_a @ (val_a @ (t_a @ X1444 @ X1445 @ X1446)) @ X1443)|(is_heap_a @ (t_a @ X1443 @ e_a @ (t_a @ X1444 @ X1445 @ X1446)))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_32_is__heap_Osimps_I3_J])])])). 0.10/0.51 thf(c_0_21, negated_conjecture, ~(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.10/0.51 thf(c_0_22, plain, ![X3:a, X13:tree_a, X10:tree_a, X6:a]:((((heapIm1091024090Down_a @ (t_a @ X6 @ e_a @ (t_a @ X3 @ X10 @ X13)))=(t_a @ X6 @ e_a @ (t_a @ X3 @ X10 @ X13)))|~((ord_less_eq_a @ (val_a @ (t_a @ X3 @ X10 @ X13)) @ X6)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.10/0.51 thf(c_0_23, plain, ![X3:a, X10:tree_a, X13:tree_a]:(((heapIm1257206334ight_a @ (t_a @ X3 @ X10 @ X13))=(X13))), inference(split_conjunct,[status(thm)],[c_0_18])). 0.10/0.51 thf(c_0_24, plain, ((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ v2 @ e_a @ ra)), inference(rw,[status(thm)],[c_0_16, c_0_19])). 0.10/0.51 thf(c_0_25, plain, ![X3:a, X13:tree_a, X10:tree_a, X6:a]:(((is_heap_a @ (t_a @ X6 @ e_a @ (t_a @ X3 @ X10 @ X13)))|~((is_heap_a @ (t_a @ X3 @ X10 @ X13)))|~((ord_less_eq_a @ (val_a @ (t_a @ X3 @ X10 @ X13)) @ X6)))), inference(split_conjunct,[status(thm)],[c_0_20])). 0.10/0.51 thf(c_0_26, negated_conjecture, ~((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.10/0.51 thf(c_0_27, plain, ![X13:tree_a, X10:tree_a, X6:a, X3:a]:((((heapIm1091024090Down_a @ (t_a @ X3 @ e_a @ (t_a @ X6 @ X10 @ X13)))=(t_a @ X3 @ e_a @ (t_a @ X6 @ X10 @ X13)))|~((ord_less_eq_a @ X6 @ X3)))), inference(rw,[status(thm)],[c_0_22, c_0_15])). 0.10/0.51 thf(c_0_28, plain, ((t_a @ v1 @ l1 @ r1)=(ra)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_23])). 0.10/0.51 thf(c_0_29, plain, (ord_less_eq_a @ v1 @ v2), inference(split_conjunct,[status(thm)],[fact_4_True])). 0.10/0.51 thf(c_0_30, plain, ![X13:tree_a, X10:tree_a, X6:a, X3:a]:(((is_heap_a @ (t_a @ X3 @ e_a @ (t_a @ X6 @ X10 @ X13)))|~((is_heap_a @ (t_a @ X6 @ X10 @ X13)))|~((ord_less_eq_a @ X6 @ X3)))), inference(rw,[status(thm)],[c_0_25, c_0_15])). 0.10/0.51 thf(c_0_31, plain, (is_heap_a @ ra), inference(split_conjunct,[status(thm)],[fact_0__C4_Oprems_C_I2_J])). 0.10/0.51 thf(c_0_32, negated_conjecture, ~((is_heap_a @ (t_a @ v2 @ e_a @ ra))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28]), c_0_29])])). 0.10/0.51 thf(c_0_33, plain, ![X3:a]:(((is_heap_a @ (t_a @ X3 @ e_a @ ra))|~((ord_less_eq_a @ v1 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_28]), c_0_31])])). 0.10/0.51 thf(c_0_34, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_29])]), ['proof']). 0.10/0.51 # SZS output end CNFRefutation 0.10/0.51 # Parsed axioms : 240 0.10/0.51 # Removed by relevancy pruning/SinE : 0 0.10/0.51 # Initial clauses : 473 0.10/0.51 # Removed in clause preprocessing : 81 0.10/0.51 # Initial clauses in saturation : 392 0.10/0.51 # Processed clauses : 1050 0.10/0.51 # ...of these trivial : 17 0.10/0.51 # ...subsumed : 301 0.10/0.51 # ...remaining for further processing : 732 0.10/0.51 # Other redundant clauses eliminated : 101 0.10/0.51 # Clauses deleted for lack of memory : 0 0.10/0.51 # Backward-subsumed : 29 0.10/0.51 # Backward-rewritten : 18 0.10/0.51 # Generated clauses : 1675 0.10/0.51 # ...of the previous two non-redundant : 1398 0.10/0.51 # ...aggressively subsumed : 0 0.10/0.51 # Contextual simplify-reflections : 0 0.10/0.51 # Paramodulations : 1558 0.10/0.51 # Factorizations : 2 0.10/0.51 # NegExts : 0 0.10/0.51 # Equation resolutions : 109 0.10/0.51 # Propositional unsat checks : 0 0.10/0.51 # Propositional check models : 0 0.10/0.51 # Propositional check unsatisfiable : 0 0.10/0.51 # Propositional clauses : 0 0.10/0.51 # Propositional clauses after purity: 0 0.10/0.51 # Propositional unsat core size : 0 0.10/0.51 # Propositional preprocessing time : 0.000 0.10/0.51 # Propositional encoding time : 0.000 0.10/0.51 # Propositional solver time : 0.000 0.10/0.51 # Success case prop preproc time : 0.000 0.10/0.51 # Success case prop encoding time : 0.000 0.10/0.51 # Success case prop solver time : 0.000 0.10/0.51 # Current number of processed clauses : 382 0.10/0.51 # Positive orientable unit clauses : 76 0.10/0.51 # Positive unorientable unit clauses: 1 0.10/0.51 # Negative unit clauses : 79 0.10/0.51 # Non-unit-clauses : 226 0.10/0.51 # Current number of unprocessed clauses: 920 0.10/0.51 # ...number of literals in the above : 2383 0.10/0.51 # Current number of archived formulas : 0 0.10/0.51 # Current number of archived clauses : 303 0.10/0.51 # Clause-clause subsumption calls (NU) : 15459 0.10/0.51 # Rec. Clause-clause subsumption calls : 9798 0.10/0.51 # Non-unit clause-clause subsumptions : 180 0.10/0.51 # Unit Clause-clause subsumption calls : 2107 0.10/0.51 # Rewrite failures with RHS unbound : 0 0.10/0.51 # BW rewrite match attempts : 26 0.10/0.51 # BW rewrite match successes : 10 0.10/0.51 # Condensation attempts : 1050 0.10/0.51 # Condensation successes : 14 0.10/0.51 # Termbank termtop insertions : 56016 0.10/0.51 0.10/0.51 # ------------------------------------------------- 0.10/0.51 # User time : 0.103 s 0.10/0.51 # System time : 0.010 s 0.10/0.51 # Total time : 0.113 s 0.10/0.51 # Maximum resident set size: 4004 pages 0.10/0.51 0.10/0.51 # ------------------------------------------------- 0.10/0.51 # User time : 0.113 s 0.10/0.51 # System time : 0.011 s 0.10/0.51 # Total time : 0.124 s 0.10/0.51 # Maximum resident set size: 2252 pages 0.10/0.51 EOF